Collective Graphical Models

Message Passing for Collective Graphical Models

Collective graphical models (CGMs) are a formalism for inference and learning with aggregate data that are motivated by a model for bird migration. We highlight a close connection between approximate MAP inference in CGMs and marginal inference in standard graphical models. The connection leads us to derive a novel Belief Propagation (BP)-style algorithm for collective graphical models. The alg...

Modèles graphiques décomposables pour la décision individuelle et collective. (Decomposable graphical models for individual and collective decision)

Approximate Inference in Collective Graphical Models

We study the problem of approximate inference in collective graphical models (CGMs), which were recently introduced to model the problem of learning and inference with noisy aggregate observations. We first analyze the complexity of inference in CGMs: unlike inference in conventional graphical models, exact inference in CGMs is NP-hard even for tree-structured models. We then develop a tractabl...

Stacked Graphical Learning

In reality there are many relational datasets in which both features of instances and the relationships among the instances are recorded, such as hyperlinked web pages, scientific literature with citations, and social networks. Collective classification has been widely used to classify a group of related instances simultaneously. Recently there have been several studies on statistical relationa...

Stacked Graphical Models for Efficient Inference in Markov Random Fields

In collective classification, classes are predicted simultaneously for a group of related instances, rather than predicting a class for each instance separately. Collective classification has been widely used for classification on relational datasets. However, the inference procedure used in collective classification usually requires many iterations and thus is expensive. We propose stacked gra...

Differentially Private Learning of Undirected Graphical Models Using Collective Graphical Models

We investigate the problem of learning discrete, undirected graphical models in a differentially private way. We show that the approach of releasing noisy sufficient statistics using the Laplace mechanism achieves a good trade-off between privacy, utility, and practicality. A naive learning algorithm that uses the noisy sufficient statistics “as is” outperforms general-purpose differentially pr...